Linear Beamformer Design for Interference Alignment via Rank Minimization
نویسندگان
چکیده
منابع مشابه
Rank Minimization via Online Learning
Minimum rank problems arise frequently in machine learning applications and are notoriously difficult to solve due to the non-convex nature of the rank objective. In this paper, we present the first online learning approach for the problem of rank minimization of matrices over polyhedral sets. In particular, we present two online learning algorithms for rank minimization our first algorithm is ...
متن کاملOn Linear Scaling via Interference Alignment at Finite SNR
Real Interference Alignment, proposed in the literature by Motahari et. al., achieves the maximal degrees of freedom (d.o.f.) for the time-invariant K-user Gaussian interference channel (K-GIC). With the surprising result that, for almost all realizations of the static channel, each user can support half the interference free rate in the high SNR limit, it is not clear whether each user can be ...
متن کاملOn Beamformer Design for Multiuser MIMO Interference Channels
This paper considers several linear beamformer design paradigms for multiuser time-invariant multiple-input multiple-output interference channels. Notably, interference alignment and sum-rate based algorithms such as the maximum signal-to-interference-plus noise (max-SINR) algorithm are considered. Optimal linear beamforming under interference alignment consists of two layers; an inner precoder...
متن کاملDiscovering Structure via Matrix Rank Minimization
16. SECURITY CLASSIFICATION OF: 19b. TELEPHONE NUMBER (Include area code) The public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this bur...
متن کاملGuaranteed Rank Minimization via Singular Value Projection
Minimizing the rank of a matrix subject to affine constraints is a fundamental problem with many important applications in machine learning and statistics. In this paper we propose a simple and fast algorithm SVP (Singular Value Projection) for rank minimization with affine constraints (ARMP) and show that SVP recovers the minimum rank solution for affine constraints that satisfy the restricted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2015
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2460223